On magic labelings of type (1,1,1) for the special class of plane graphsBACA, M.Journal of the Franklin Institute. 1992, Vol 329, Num 3, pp 549-553, issn 0016-0032Article

On magic labelings of honeycombBACA, M.Discrete mathematics. 1992, Vol 105, Num 1-3, pp 305-311, issn 0012-365XArticle

Equitable labelings of cyclesWOJCIECHOWSKI, J.Journal of graph theory. 1993, Vol 17, Num 4, pp 531-547, issn 0364-9024Article

Pair labellings with given distanceFUREDI, Z; GRIGGS, J. R; KLEITMAN, D. J et al.SIAM journal on discrete mathematics. 1989, Vol 2, Num 4, pp 491-499, 9 p.Article

THE INCIDENCE MATRIX AND LABELINGS OF A GRAPHJEURISSEN RH.1981; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1981; VOL. 30; NO 3; PP. 290-301; BIBL. 4 REF.Article

A NOTE ON THE EVALUATION OF PROBABILISTIC LABELINGSPELEG S; ROSENFELD A.1981; IEEE TRANS. SYST. MAN CYBERN.; ISSN 0018-9472; USA; DA. 1981; VOL. 11; NO 2; PP. 176-179; BIBL. 10 REF.Article

EINE STRENGE BEGRUENDUNG DYNAMISCHER PROGRAMME UND DIE BESTIMMUNG AUSGEZEICHNETER KNOTEN-ODER KANTENMENGEN IN ENDLICHEN GRAPHEN = UNE BASE STRICTE DES PROGRAMMES DYNAMIQUES ET L'EVALUATION DES GROUPES DE NOEUDS OU D'ARETES MARQUES DANS LES GRAPHES FINIS.TINHOFER G.1973; MONASTSH. MATH.; OSTERR.; DA. 1973; VOL. 77; NO 2; PP. 148-155; BIBL. 6 REF.Serial Issue

MARKING ALGORITHMSTHORELLI LE.1972; B.I.T.; DANM.; DA. 1972; VOL. 12; NO 4; PP. 555-568; BIBL. 8 REF.Serial Issue

EIN MARKIERAL GORITHMUS ZUR LOESUNG VON ALLGEMEINEN TRANSPORT-PROBLEMENT MIT EINEM BUENDEL. = UN ALGORITHME DE MARQUAGE POUR LA RESOLUTION DE PROBLEMES DE TRANSPORT GENERAUX AVEC FAISCEAUHASSIG K.1974; Z. OPER. RES.; DTSCH.; DA. 1974; VOL. 18; NO 3; PP. 105-116; ABS. ANGL.; BIBL. 5 REF.Article

Strong edge-magic graphs of maximum sizeMACDOUGALL, J. A; WALLIS, W. D.Discrete mathematics. 2008, Vol 308, Num 13, pp 2756-2763, issn 0012-365X, 8 p.Article

A survey on labeling graphs with a condition at distance twoYEH, Roger K.Discrete mathematics. 2006, Vol 306, Num 12, pp 1217-1231, issn 0012-365X, 15 p.Article

Super edge-magic strength of fire crackers, banana trees and unicyclic graphsSWAMINATHAN, V; JEYANTHI, P.Discrete mathematics. 2006, Vol 306, Num 14, pp 1624-1636, issn 0012-365X, 13 p.Conference Paper

The Roman domatic number of a graphSHEIKHOLESLAMI, S. M; VOLKMANN, L.Applied mathematics letters. 2010, Vol 23, Num 10, pp 1295-1300, issn 0893-9659, 6 p.Article

NEPS operations on cordial graphsKIRCHHERR, W. W.Discrete mathematics. 1993, Vol 115, Num 1-3, pp 201-209, issn 0012-365XArticle

Simply sequentially additive labelings of 2-regular graphsHAJNAL, Péter; NAGY, Gábor.Discrete mathematics. 2010, Vol 310, Num 4, pp 922-928, issn 0012-365X, 7 p.Article

The joint sum of graceful treesDE-JUN JIN; SI-ZHANG LIU; SANG-HO LEE et al.Computers & mathematics with applications (1987). 1993, Vol 26, Num 10, pp 83-87, issn 0898-1221Article

The radical product of graceful treesSI-ZHANG LIU; DE-JUN JIN; SANG-HO LEE et al.Computers & mathematics with applications (1987). 1993, Vol 26, Num 10, pp 89-93, issn 0898-1221Article

Labelings of a certain class of convex polytopesBACA, M; HOLLÄNDER, I.Journal of the Franklin Institute. 1992, Vol 329, Num 3, pp 539-547, issn 0016-0032Article

Short Labels by Traversal and JumpingBONICHON, Nicolas; GAVOILLE, Cyril; LABOUREL, Arnaud et al.Lecture notes in computer science. 2006, pp 143-156, issn 0302-9743, isbn 3-540-35474-3, 1Vol, 14 p.Conference Paper

0-centred and 0-ubiquitously graceful treesVAN BUSSEL, Frank.Discrete mathematics. 2004, Vol 277, Num 1-3, pp 193-218, issn 0012-365X, 26 p.Article

Minimal sense of direction in regular networksFLOCCHINI, P.Information processing letters. 1997, Vol 61, Num 6, pp 331-338, issn 0020-0190Article

A computational improvement for a shortest paths ranking algorithmDE AZEVEDO, J. A; SILVESTRE MADEIRA, J. J. E. R; VIEIRA MARTINS, E. Q et al.European journal of operational research. 1994, Vol 73, Num 1, pp 188-191, issn 0377-2217Article

On the harmoniousness of dicyclic groupsCHENG-DE WANG.Discrete mathematics. 1993, Vol 120, Num 1-3, pp 221-225, issn 0012-365XArticle

On finding the rectangular duals of planar triangular graphsXIN HE.SIAM journal on computing (Print). 1993, Vol 22, Num 6, pp 1218-1226, issn 0097-5397Article

Page / 12